P-matrix completions under weak symmetry assumptions
نویسندگان
چکیده
منابع مشابه
Completions of P-matrix patterns
A list of positions in an n × n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend work of Johnson and Kroschel [JK] by proving a larger class of patterns has Pcompletion, including any 4 × 4 pattern with eight or fewer off-diagonal positions. We also show that any pattern whose digraph ...
متن کاملErgodic BSDEs under weak dissipative assumptions
In this paper we study ergodic backward stochastic differential equations (EBSDEs) dropping the strong dissipativity assumption needed in [12]. In other words we do not need to require the uniform exponential decay of the difference of two solutions of the underlying forward equation, which, on the contrary, is assumed to be non degenerate. We show existence of solutions by use of coupling esti...
متن کاملEstimating Undirected Graphs Under Weak Assumptions
We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension D to increase with the sample size n. First, we prove lower bounds that show that if we want accurate inferences with low assumptions then there are limitations on the dimension as a func...
متن کاملSparse recovery under weak moment assumptions
We prove that iid random vectors that satisfy a rather weak moment assumption can be used as measurement vectors in Compressed Sensing, and the number of measurements required for exact reconstruction is the same as the best possible estimate – exhibited by a random Gaussian matrix. We then show that this moment condition is necessary, up to a log log factor. In addition, we explore the Compati...
متن کاملLogics with Common Weak Completions
We introduce the notion of X-stable models parametrized by a given logic X. Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T if M is a model of T, in the sense of classical logic, and the weak completion of T (namely T [ : e M) can prove, in the sense given by logic X, every atom in the set M. We prove that, for normal log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00088-4